Competitive subset selection with two agents
نویسندگان
چکیده
منابع مشابه
Competitive subset selection with two agents
We address an optimization problem in which two agents, each with a set of weighted items, compete in order to maximize the total weight of their winning sets. The latter are built according to a sequential game consisting in a fixed number of rounds. In every round each agent submits one item for possible inclusion in its winning set. We study two natural rules to decide the winner of each rou...
متن کاملMinimum cost subset selection with two competing agents
We address an optimization problem in which two agents, each with a set of weighted items, compete in order to minimize the total weight of their solution sets. The latter are built according to a sequential game consisting in a fixed number of rounds. In every round each agent submits one item that may be included in its solution set. We study two natural rules to decide which item between the...
متن کاملCompetitive Market Structures: a Subset Selection Analysis
Market structure models are used to identify submarkets or to test for the presence of submarkets where within-group competition is much stronger than across group competition. The implicit assumption in such models is that the brands in a submarket compete on the basis of their shared product features. However, if significant variety-seeking effects exist in the market, such an assumption may ...
متن کاملSubset Weight Maximization with Two Competing Agents
We consider a game of two agents competing to add items into a solution set. Each agent owns a set of weighted items and seeks to maximize the sum of their weights in the solution set. In each round each agent submits one item for inclusion in the solution. We study two natural rules to decide the winner of each round: Rule 1 picks among the two submitted items the item with larger weight, Rule...
متن کاملHypervolume Subset Selection in Two Dimensions: Formulations and Algorithms
The hypervolume subset selection problem consists of finding a subset, with a given cardinality k, of a set of nondominated points that maximizes the hypervolume indicator. This problem arises in selection procedures of evolutionary algorithms for multiobjective optimization, for which practically efficient algorithms are required. In this article, two new formulations are provided for the two-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.11.011